Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra

نویسندگان

  • Marc Bezem
  • Robert Nieuwenhuis
  • Enric Rodríguez-Carbonell
چکیده

In [Butkovič and Zimmermann(2006)] an ingenious algorithm for solving systems of twosided linear equations in max-algebra was given and claimed to be strongly polynomial. However, in this note we give a sequence of examples showing exponential behaviour of the algorithm. We conclude that the problem of finding a strongly polynomial algorithm is still open.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A strongly polynomial algorithm for solving two-sided linear systems in max-algebra

An algorithm for solving m× n systems of (max,+)-linear equations is presented. The systems have variables on both sides of the equations. After O(m4n4) iterations the algorithm either finds a solution of the system or finds out that no solution exists. Each iteration needs O(mn) operations so that the complexity of the presented algorithm is O(m5n5). © 2005 Elsevier B.V. All rights reserved.

متن کامل

Solving Systems of Two-Sided (Max, Min)-Linear Equations

A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.

متن کامل

On the integer max-linear programming problem

For a generic class of matrices we show that integer solutions to two-sided max-linear systems and programs can be found in polynomial time. For general matrices we adapt the existing methods for finding real solutions to obtain algorithms for finding integer solutions.

متن کامل

A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS

There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...

متن کامل

On the solvability of homogeneous two-sided systems in max-algebra

Let a⊕b = max(a, b) and a⊗b = a+b for a, b ∈ R and extend the pair of operations to matrices and vectors in the same way as in linear algebra. The homogeneous twosided system in max-algebra is of the form A⊗ x = B ⊗ x. No polynomial method for solving homogeneous system is known. In this paper, we consider homogeneous twosided linear systems in max-algebra in a special case. We show that it can...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 156  شماره 

صفحات  -

تاریخ انتشار 2008